The theory of ordering lexicographic entries: Principles, algorithms and computer implementation
Identifieur interne : 000584 ( Main/Exploration ); précédent : 000583; suivant : 000585The theory of ordering lexicographic entries: Principles, algorithms and computer implementation
Auteurs : Andrzej Ziabicki [Pologne]Source :
- Computers and the Humanities [ 0010-4817 ] ; 1992-04-01.
Abstract
Abstract: A general theory of ordering lexicographic entries in various languages is formulated. Basic concepts and principles of one-, and many-step ordering are discussed. The algorithms for one-step (alphabetic), two-step (alphabetic with diacritical marks) and many-step ordering (with attributes) are derived and illustrated on examples. A simple method of computer implementation is proposed. The method consists in creation and sorting of extended alphanumeric strings containing the information about all steps of ordering. The problems encountered in implementation of the theory: transcription of lexicographic entries into a standard ASCII format, identification of alphabetic units, diacritical marks, ligatures and contractions, as well as creation of extended strings, are discussed. A master program applicable to various languages is described and example application to Spanish language discussed.
Url:
DOI: 10.1007/BF00116348
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000491
- to stream Istex, to step Curation: 000491
- to stream Istex, to step Checkpoint: 000480
- to stream Main, to step Merge: 000623
- to stream Main, to step Curation: 000584
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The theory of ordering lexicographic entries: Principles, algorithms and computer implementation</title><author><name sortKey="Ziabicki, Andrzej" sort="Ziabicki, Andrzej" uniqKey="Ziabicki A" first="Andrzej" last="Ziabicki">Andrzej Ziabicki</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:2CDB06F749050FE4BD157F20A61C65E750239F86</idno><date when="1992" year="1992">1992</date><idno type="doi">10.1007/BF00116348</idno><idno type="url">https://api.istex.fr/document/2CDB06F749050FE4BD157F20A61C65E750239F86/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000491</idno><idno type="wicri:Area/Istex/Curation">000491</idno><idno type="wicri:Area/Istex/Checkpoint">000480</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000480</idno><idno type="wicri:doubleKey">0010-4817:1992:Ziabicki A:the:theory:of</idno><idno type="wicri:Area/Main/Merge">000623</idno><idno type="wicri:Area/Main/Curation">000584</idno><idno type="wicri:Area/Main/Exploration">000584</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The theory of ordering lexicographic entries: Principles, algorithms and computer implementation</title><author><name sortKey="Ziabicki, Andrzej" sort="Ziabicki, Andrzej" uniqKey="Ziabicki A" first="Andrzej" last="Ziabicki">Andrzej Ziabicki</name><affiliation wicri:level="1"><country xml:lang="fr">Pologne</country><wicri:regionArea>Polish Academy of Sciences, 21 Swietokrzyska St., Warsaw</wicri:regionArea><wicri:noRegion>Warsaw</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Computers and the Humanities</title><title level="j" type="abbrev">Comput Hum</title><idno type="ISSN">0010-4817</idno><idno type="eISSN">1572-8412</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="1992-04-01">1992-04-01</date><biblScope unit="volume">26</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="119">119</biblScope><biblScope unit="page" to="137">137</biblScope></imprint><idno type="ISSN">0010-4817</idno></series><idno type="istex">2CDB06F749050FE4BD157F20A61C65E750239F86</idno><idno type="DOI">10.1007/BF00116348</idno><idno type="ArticleID">BF00116348</idno><idno type="ArticleID">Art3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0010-4817</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A general theory of ordering lexicographic entries in various languages is formulated. Basic concepts and principles of one-, and many-step ordering are discussed. The algorithms for one-step (alphabetic), two-step (alphabetic with diacritical marks) and many-step ordering (with attributes) are derived and illustrated on examples. A simple method of computer implementation is proposed. The method consists in creation and sorting of extended alphanumeric strings containing the information about all steps of ordering. The problems encountered in implementation of the theory: transcription of lexicographic entries into a standard ASCII format, identification of alphabetic units, diacritical marks, ligatures and contractions, as well as creation of extended strings, are discussed. A master program applicable to various languages is described and example application to Spanish language discussed.</div></front></TEI><affiliations><list><country><li>Pologne</li></country></list><tree><country name="Pologne"><noRegion><name sortKey="Ziabicki, Andrzej" sort="Ziabicki, Andrzej" uniqKey="Ziabicki A" first="Andrzej" last="Ziabicki">Andrzej Ziabicki</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Ticri/explor/TeiVM2/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000584 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000584 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Ticri
|area= TeiVM2
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:2CDB06F749050FE4BD157F20A61C65E750239F86
|texte= The theory of ordering lexicographic entries: Principles, algorithms and computer implementation
}}
| This area was generated with Dilib version V0.6.31. |  |